Fast Path Planning Algorithm for the RoboCup Small Size League

نویسندگان

  • Saith Rodríguez
  • Eyberth Rojas
  • Katherín Pérez
  • Jorge López
  • Carlos A. Quintero
  • Juan M. Calderón
چکیده

Plenty of work based on the Rapidly-exploring Random Trees (RRT) algorithm for path planning in real time has been developed recently. This is the most used algorithm by the top research teams in the Small Size League of RoboCup. Nevertheless, we have concluded that other simpler alternatives show better results under these highly dynamic environments. In this work, we propose a new path planning algorithm that meets all the robotic soccer challenges requirements, which has already been implemented in the STOx’s team for the RoboCup competition in 2013. We have evaluated the algorithm’s performance using metrics such as the smoothness of the paths, the traveled distance and the processing time and compared it with the RRT algorithm’s. The results showed improved performance over RRT when combined measures are used.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RoboCup Small-Size League: Past, Present and Future

The Small Size Robot League (SSL) was among the founding RoboCup leagues in the 1997 competition held during IJCAI’97 in Nagoya, Japan. Since then, the league has experienced various advances in terms of robot design, number of robots, field size, software algorithms and other infrastructure used during the games, among these the recent standardization of the vision system shared by all teams. ...

متن کامل

Improved Path Planning in Highly Dynamic Environments Based on Time Variant Potential Fields

Introduction Planning collision-free paths is one of the basic skills for a mobile robot performing a goal-oriented task. Especially in highly dynamic environments such as robot soccer there is a need for smooth navigation avoiding the cooperating and competing players. Today, robots in RoboCup [5] are moving at speeds of up to 3 m/s. Navigation thus requires real time path planning considering...

متن کامل

Path Planning of a Mobile Robot as a Discrete Optimization Problem an Adjustment of Weight Parameters in the Objective Function by Reinforcement Learning

p. 1 Champion Teams FC Portugal Team Description: RoboCup 2000 Simulation League Champion p. 29 The Cornell RoboCup Team p. 41 CS Freiburg: Doing the Right Thing in a Group p. 52 The UNSW RoboCup 2000 Sony Legged League Team p. 64 Challenge Award Finalists Adaptive Path Planner for Highly Dynamic Environments p. 76 Communication and Coordination Among Heterogeneous Mid-Size Players: ART99 p. 86...

متن کامل

Multi-robot team response to a multi-robot opponent team

Adversarial multi-robot problems, where teams of robots compete with one another, require the development of approaches that span all levels of control and integrate algorithms ranging from low-level robot motion control, through to planning, opponent modeling, and multiagent learning. Small-size robot soccer, a league within the RoboCup initiative, is a prime example of this multi-robot team a...

متن کامل

Multiresolution Path Planning in Dynamic Environments for the Standard Platform League

Following obstacle free paths towards the ball and avoiding opponents while dribbling are key skills to win soccer games. These tasks are challenging as the robot’s environment in soccer games is highly dynamic. Thus, exact plans will likely become invalid in the future and continuous replanning is necessary. The robots of the RoboCup Standard Platform League are equipped with limited computati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014